On a Quadratic Functional Occurring in a Bivariate Scattered Data Interpolation Problem
نویسنده
چکیده
The application of widely known blending methods for constructing C bivariate functions interpolating scattered data requires the knowledge of the partial derivatives of first order at the vertices of an underlying triangulation. In this paper we consider the method proposed by Nielson that consists in computing estimates of the first order partial derivatives by minimizing an appropriate quadratic functional, characterized by nonnegative tension parameters. The aim of the paper is to analyse some peculiar properties of this functional in order to construct robust and efficient algorithms for determining the above estimates of the derivatives when we are concerned with extremely large data sets.
منابع مشابه
Convex Preserving Scattered Data
We use bivariate C 1 cubic splines to deal with convexity preserving scattered data interpolation problem. Using a necessary and suucient condition on Bernstein-B ezier polynomials, we set the convexity preserving interpolation problem into a quadratically constraint quadratic programming problem. We show the existence of convexity preserving interpolatory surfaces under certain conditions on t...
متن کاملBivariate mean value interpolation on circles of the same radius
We consider bivariate mean-value interpolationproblem, where the integrals over circles are interpolation data. In this case the problem is described over circles of the same radius and with centers are on astraight line and it is shown that in this case the interpolation is not correct.
متن کاملScattered data interpolation by bivariate splines with higher approximation order
Given a set of scattered data, we usually use a minimal energy method to find Lagrange interpolation based on bivariate spline spaces over a triangulation of the scattered data locations. It is known that the approximation order of the minimal energy spline interpolation is only 2 in terms of the size of triangulation. To improve this order of approximation, we propose several new schemes in th...
متن کاملOn the bivariate Shepard-Lidstone operators
We propose a new combination of the bivariate Shepard operators [10] by the three point Lidstone polynomials introduced in [12]. The new combination inherits both degree of exactness and Lidstone interpolation conditions at each node, which characterize the interpolation polynomial. These new operators nd application to the scattered data interpolation problem when supplementary second order d...
متن کاملError Bounds for Scattered Data Interpolation in R by Minimum Norm Networks
We consider the problem of interpolating scattered data in R assuming that the data are sampled from a smooth bivariate function F = F (x, y). For a fixed triangulation T associated with the projections of the data onto the plane Oxy we consider Nielson’s minimum norm interpolation network S defined in [6] and prove an estimate of the form ‖F−S‖L2(T ) ≤ C(T ) ‖F IV ‖L2(T ). The dependence of th...
متن کامل